The cyclic genetic code as a constraint satisfaction problem
نویسندگان
چکیده
منابع مشابه
The cyclic genetic code as a constraint satisfaction problem
We consider in this paper a combinatorial problem we propose to solve with a constraint satisfaction method well de,ned at the beginning of the real game of life: this problem consists in extracting from the classical degenerate genetic code made of 64 triplets, a non-degenerate cyclic code made of 22 triplets, which we call the cyclic AB code. It is made up of the following chain: AUGGUGCCAUUC...
متن کاملSudoku as a Constraint Satisfaction Problem
Purpose of this paper is to approach and solve Sudoku as a Constraint Satisfaction Problem and to compare various heuristics and their effects on solving the problem. Heuristics compared include Backtracking with Forward Checking and Minimum Remaining Value, Arc Consistency, and Arc Consistency Pre-Processing.
متن کاملAlgorithmic Composition as a Constraint Satisfaction Problem
Throughout the history, musicians have always used music composition rules, which actually are in most cases prohibitions or constraints. The elements of music with which composers work, as well as the possible combinations of those elements, make up a huge finite set of values. The composer’s function is to select, from this big set, a subset of values, which will be arranged into a certain te...
متن کاملCourse Scheduling As A Constraint Satisfaction Problem
This paper describes a scheduling system to fullll the timetabling needs of the Computer Science program at Florida Institute of Technology. The system handles both general constraints of timetabling problems and constraints speciic to our problem. It has the exibility of allowing for either manual or automatic assignments. The scheduling process is split into two phases; each phase is modeled ...
متن کاملMinesweeper as a Constraint Satisfaction Problem
Minesweeper is a simple one−player computer game commonly found on machines with popular operating systems such as Linux or Microsoft Windows. The game consists of a 2 dimensional rectangular playing field (or board) where some known number of mines have been hidden. Initially, all of the squares on the board are "covered up" and no information is given to indicate the location of the mines. Th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2004
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2004.03.015